On a Resolution Theorem for Maximal ModelsDimitris
نویسندگان
چکیده
We formulate and prove a resolution-like theorem that reduces the unnegated variables of a Boolean formula in Conjunctive Normal Form by one, while preserving the maximal models of the formula. This has an impact to the generation of all maximal models of a Horn formula as repeated applications of the theorem lead to a Boolean formula in which each clause has only negated variables and thus reduces the problem to the generation of the transversal hypergraph.
منابع مشابه
Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem
In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملFrobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملOn normalizers of maximal subfields of division algebras
Here, we investigate a conjecture posed by Amiri and Ariannejad claiming that if every maximal subfield of a division ring $D$ has trivial normalizer, then $D$ is commutative. Using Amitsur classification of finite subgroups of division rings, it is essentially shown that if $D$ is finite dimensional over its center then it contains a maximal subfield with non-trivial normalize...
متن کاملOn the Ultramean Construction
We use the ultramean construction to prove linear compactness theorem. We also extend the Rudin-Keisler ordering to maximal probability charges and characterize it by embeddings of power ultrameans.
متن کامل